Improved recursive DV-Hop localization algorithm for average hop distance optimization

نویسندگان

چکیده

Aiming at the problem of DV-HOP algorithm with error and energy exhaustion, average hop distance is used for optimization, an improved recursion method to solve it. The first squares anchor nodes, proposes a forgetting factor optimize between secondly uses recursive operations replace nodes insufficient energy, so that localization process unknown can continue. Experimental results show compared DV-Hop algorithms in related literature, reduce certain extent improve accuracy nodes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved DV-Hop Localization Algorithm Based on Hop Distance and Hops Correction

In order to solve the problem that the DV-Hop algorithm has large error in the network topology environment of random distribution of nodes, this paper proposes a WSN localization algorithm based on hop distance correction. The algorithm uses the method of multi communication radius to correct the hop number within 1 hops, which makes it more consistent with the real situation; Then, the weight...

متن کامل

An Improved Location Algorithm for DV-HOP Based on Trusty Degree Average Hop Distance in Wireless Sensor Networks

Location awareness is an attractive research issue in the wireless sensor networks (WSN) because sensor nodes are randomly scattered over a region and can get connected into a network on their own. However, precise location information may be unavailable due to the constraint in energy, computation, or terrain. In this paper, an improved DV-HOP location algorithm based on trusty degree average ...

متن کامل

An Improved DV-Hop Wireless Sensor Network Localization Algorithm

The positioning accuracy is not high for the range-free localization algorithm DV-Hop in wireless sensor networks and the Particle Swarm Optimization algorithm is proposed to optimize the positioning accuracy of the DV-Hop and the IDV-Hop localization algorithm is also proposed. Firstly, the IDV-Hop utilizes DV-Hop to estimate the measuring distances between nodes to be positioned and the beaco...

متن کامل

Optimization Research of the DV-Hop Localization Algorithm

The traditional DV-Hop sensor location algorithm estimates the distance between unknown nodes and anchor nodes by hop distance instead of straight-line distance. In the actual location condition, unknown nodes and anchor nodes mostly connect to each other through broken line. When the deviation of the estimated value and the actual value of average distance per hop is large, the error of estima...

متن کامل

An Improved DV-Hop Localization Algorithm Based on Energy-saving Non-ranging Optimization

In order to reduce energy-consumption and hardware investment in wireless sensor networks, an improved DV-Hop localization algorithm based on energy-saving non-ranging optimization is proposed. In this algorithm, only one anchor node broadcasts its position coordinate information to other node, thus greatly reducing the energy consumption of the node. Non-ranging energy-saving optimization algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MATEC web of conferences

سال: 2021

ISSN: ['2261-236X', '2274-7214']

DOI: https://doi.org/10.1051/matecconf/202133607014